Groups Having a Maximum Number Set of Conjugate Independent Generators
نویسندگان
چکیده
منابع مشابه
Conjugate Generators of Knot and Link Groups
This note shows that if two elements of equal trace (e.g., conjugate elements) generate an arithmetic two-bridge knot or link group, then the elements are parabolic. This includes the figure-eight knot and Whitehead link groups. Similarly, if two conjugate elements generate the trefoil knot group, then the elements are peripheral.
متن کاملMaximum independent set of rectangles
We study the Maximum Independent Set of Rectangles (MISR) problem: given a collection R of n axis-parallel rectangles, find a maximum-cardinality subset of disjoint rectangles. MISR is a special case of the classical Maximum Independent Set problem, where the input is restricted to intersection graphs of axis-parallel rectangles. Due to its many applications, ranging from map labeling to data m...
متن کاملon the number of maximum independent sets of graphs
let $g$ be a simple graph. an independent set is a set ofpairwise non-adjacent vertices. the number of vertices in a maximum independent set of $g$ isdenoted by $alpha(g)$. in this paper, we characterize graphs $g$ with $n$ vertices and with maximumnumber of maximum independent sets provided that $alpha(g)leq 2$ or $alpha(g)geq n-3$.
متن کاملBounds on the Number of Vectors Having a Specified Maximum
Code Division Multiple Access (CDMA) technology allows a large number of mobile radio users to share limited bandwidth simultaneously. This is achieved by spreading individual users’ signals over available bandwidth with orthogonal spreading codes—the orthogonality of the spreading codes allows individual signals to be distinguished. The effective use of bandwidth in this system is a considerab...
متن کاملAn Optimal Algorithm to Find Maximum Independent Set and Maximum 2-Independent Set on Cactus Graphs
A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to find a maximum independent set and maximum 2-independent set on cactus graphs in O(n) time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1938
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.24.2.94